MultiCore Parallelisation for Hume

نویسندگان

  • Abdallah Al Zain
  • Greg Michaelson
  • Kevin Hammond
چکیده

With the emergence of commodity multicore architectures, exploiting tightly-coupled parallelism has become increasingly important. Hume is a novel formally-motivated programming language oriented to developing software where strong assurance of resource use is paramount, in particular embedded architecture. Functional programming languages, such as Hume, are, in principle, well placed to take advantage of this trend, offering the ability to easily identify threads for parallelism in multicore architectures. Unfortunately, obtaining real performance benefits has often proved hard to realise in practice. This paper outlines the design and implementation of Hume for multicore architectures. It presents preliminary results which suggest that there is strong potential for seamless parallel gains in Hume programs. A key aspect of our approach is the use of a new and completely lock-free communication mechanism. Using this mechanism, we can obtain good parallel performance for suitable Hume programs, of up to 6.8 on eight cores.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-core parallelisation of Hume through structured transformation

The use of the Hume box calculus to systematically transform a single box into an equivalent multi-box program offering balanced parallel implementation is discussed. The approach is illustrated through the development of a multicore matrix multiplication program.

متن کامل

Inhibitors for desktop parallelisation

Parallel computing is notoriously challenging, making it difficult to develop efficient and correct programs. With the arrival of multicore processors, desktop environments must be parallelised if they are to benefit from these new processors. However, the parallelisation of desktop environments entails even more challenges than that in a typical parallel program. This report outlines such chal...

متن کامل

SCBI_MapReduce, a New Ruby Task-Farm Skeleton for Automated Parallelisation and Distribution in Chunks of Sequences: The Implementation of a Boosted Blast+

Current genomic analyses often require the managing and comparison of big data using desktop bioinformatic software that was not developed regarding multicore distribution.The task-farm SCBI MapReduce is intended to simplify the trivial parallelisation and distribution of new and legacy software and scripts for biologists who are interested in using computers but are not skilled programmers. In...

متن کامل

Discovering and exploiting parallelism in DOACROSS loops

Although multicore processors have been the norm for a decade, programmers still struggle to write parallel general-purpose applications, resulting in underutilised on-chip resources. Automatic parallelisation is a promising approach to improving the performance of such applications without burdening the programmer. I explore various techniques for automatically extracting parallelism which spa...

متن کامل

GooFit: A library for massively parallelising maximum-likelihood fits

Fitting complicated models to large datasets is a bottleneck of many analyses. We present GooFit, a library and tool for constructing arbitrarily-complex probability density functions (PDFs) to be evaluated on nVidia GPUs or on multicore CPUs using OpenMP. The massive parallelisation of dividing up event calculations between hundreds of processors can achieve speedups of factors 200-300 in real...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009